TSTP Solution File: CSR146^3 by cvc5---1.0.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : CSR146^3 : TPTP v8.1.2. Released v4.1.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n031.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Aug 30 21:07:17 EDT 2023

% Result   : Theorem 0.20s 0.54s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : CSR146^3 : TPTP v8.1.2. Released v4.1.0.
% 0.13/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.35  % Computer : n031.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon Aug 28 12:16:40 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 0.20/0.49  %----Proving TH0
% 0.20/0.50  %------------------------------------------------------------------------------
% 0.20/0.50  % File     : CSR146^3 : TPTP v8.1.2. Released v4.1.0.
% 0.20/0.50  % Domain   : Commonsense Reasoning
% 0.20/0.50  % Problem  : What is the relation between Chris and Corina during 2009?
% 0.20/0.50  % Version  : Especial.
% 0.20/0.50  % English  : During 2009 Corina is the wife of Chris. True holds at any time. 
% 0.20/0.50  %            What is the relation between Chris and Corina during 2009?
% 0.20/0.50  
% 0.20/0.50  % Refs     : [Ben10] Benzmueller (2010), Email to Geoff Sutcliffe
% 0.20/0.50  % Source   : [Ben10]
% 0.20/0.50  % Names    : ex_5.tq_SUMO_local [Ben10]
% 0.20/0.50  
% 0.20/0.50  % Status   : Theorem
% 0.20/0.50  % Rating   : 0.31 v8.1.0, 0.18 v7.5.0, 0.14 v7.4.0, 0.22 v7.2.0, 0.12 v7.1.0, 0.38 v7.0.0, 0.29 v6.4.0, 0.33 v6.3.0, 0.40 v6.2.0, 0.14 v6.1.0, 0.57 v6.0.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.40 v5.3.0, 0.60 v5.2.0, 0.40 v5.1.0, 0.60 v5.0.0, 0.40 v4.1.0
% 0.20/0.50  % Syntax   : Number of formulae    :   15 (   1 unt;   9 typ;   0 def)
% 0.20/0.50  %            Number of atoms       :   14 (   1 equ;   2 cnn)
% 0.20/0.50  %            Maximal formula atoms :    3 (   2 avg)
% 0.20/0.50  %            Number of connectives :   29 (   2   ~;   0   |;   1   &;  24   @)
% 0.20/0.50  %                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
% 0.20/0.50  %            Maximal formula depth :    9 (   5 avg)
% 0.20/0.50  %            Number of types       :    3 (   1 usr)
% 0.20/0.50  %            Number of type conns  :   19 (  19   >;   0   *;   0   +;   0  <<)
% 0.20/0.50  %            Number of symbols     :   11 (   8 usr;   5 con; 0-2 aty)
% 0.20/0.50  %            Number of variables   :    9 (   2   ^;   5   !;   2   ?;   9   :)
% 0.20/0.50  % SPC      : TH0_THM_EQU_NAR
% 0.20/0.50  
% 0.20/0.50  % Comments : This is a simple test problem for reasoning in/about SUMO.
% 0.20/0.50  %            Initally the problem has been hand generated in KIF syntax in
% 0.20/0.50  %            SigmaKEE and then automatically translated by Benzmueller's
% 0.20/0.50  %            KIF2TH0 translator into THF syntax.
% 0.20/0.50  %          : The translation has been applied in three modes: handselected,
% 0.20/0.50  %            SInE, and local. The local mode only translates the local
% 0.20/0.50  %            assumptions and the query. The SInE mode additionally translates
% 0.20/0.50  %            the SInE extract of the loaded knowledge base (usually SUMO). The
% 0.20/0.50  %            handselected mode contains a hand-selected relevant axioms.
% 0.20/0.50  %          : The examples are selected to illustrate the benefits of
% 0.20/0.50  %            higher-order reasoning in ontology reasoning.
% 0.20/0.50  %------------------------------------------------------------------------------
% 0.20/0.50  %----The extracted signature
% 0.20/0.50  thf(numbers,type,
% 0.20/0.50      num: $tType ).
% 0.20/0.50  
% 0.20/0.50  thf(holdsDuring_THFTYPE_IiooI,type,
% 0.20/0.50      holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
% 0.20/0.50  
% 0.20/0.50  thf(husband_THFTYPE_IiioI,type,
% 0.20/0.50      husband_THFTYPE_IiioI: $i > $i > $o ).
% 0.20/0.50  
% 0.20/0.50  thf(lChris_THFTYPE_i,type,
% 0.20/0.50      lChris_THFTYPE_i: $i ).
% 0.20/0.50  
% 0.20/0.50  thf(lCorina_THFTYPE_i,type,
% 0.20/0.50      lCorina_THFTYPE_i: $i ).
% 0.20/0.50  
% 0.20/0.50  thf(lYearFn_THFTYPE_IiiI,type,
% 0.20/0.50      lYearFn_THFTYPE_IiiI: $i > $i ).
% 0.20/0.50  
% 0.20/0.50  thf(n2009_THFTYPE_i,type,
% 0.20/0.50      n2009_THFTYPE_i: $i ).
% 0.20/0.50  
% 0.20/0.50  thf(wife_THFTYPE_IiioI,type,
% 0.20/0.50      wife_THFTYPE_IiioI: $i > $i > $o ).
% 0.20/0.50  
% 0.20/0.50  %----The handselected axioms from the knowledge base
% 0.20/0.50  thf(inverse_THFTYPE_IIiioIIiioIoI,type,
% 0.20/0.50      inverse_THFTYPE_IIiioIIiioIoI: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
% 0.20/0.50  
% 0.20/0.50  thf(ax,axiom,
% 0.20/0.50      inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI ).
% 0.20/0.50  
% 0.20/0.50  thf(ax_001,axiom,
% 0.20/0.50      ! [REL2: $i > $i > $o,REL1: $i > $i > $o] :
% 0.20/0.50        ( ( inverse_THFTYPE_IIiioIIiioIoI @ REL1 @ REL2 )
% 0.20/0.50       => ! [INST1: $i,INST2: $i] :
% 0.20/0.50            ( ( REL1 @ INST1 @ INST2 )
% 0.20/0.50          <=> ( REL2 @ INST2 @ INST1 ) ) ) ).
% 0.20/0.50  
% 0.20/0.50  %----The translated axioms
% 0.20/0.50  thf(ax_002,axiom,
% 0.20/0.50      ! [Z: $i] : ( holdsDuring_THFTYPE_IiooI @ Z @ $true ) ).
% 0.20/0.50  
% 0.20/0.50  thf(ax_003,axiom,
% 0.20/0.50      ? [X: $i] : ( (~) @ ( husband_THFTYPE_IiioI @ lChris_THFTYPE_i @ X ) ) ).
% 0.20/0.50  
% 0.20/0.50  thf(ax_004,axiom,
% 0.20/0.50      holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i ) ).
% 0.20/0.50  
% 0.20/0.50  %----The translated conjectures
% 0.20/0.50  thf(con,conjecture,
% 0.20/0.50      ? [R: $i > $i > $o] :
% 0.20/0.50        ( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( R @ lChris_THFTYPE_i @ lCorina_THFTYPE_i ) )
% 0.20/0.50        & ( (~)
% 0.20/0.50          @ ( R
% 0.20/0.50            = ( ^ [X: $i,Y: $i] : $true ) ) ) ) ).
% 0.20/0.50  
% 0.20/0.50  %------------------------------------------------------------------------------
% 0.20/0.54  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.QWDBKBSV7N/cvc5---1.0.5_15931.p...
% 0.20/0.54  (declare-sort $$unsorted 0)
% 0.20/0.54  (declare-sort tptp.num 0)
% 0.20/0.54  (declare-fun tptp.holdsDuring_THFTYPE_IiooI ($$unsorted Bool) Bool)
% 0.20/0.54  (declare-fun tptp.husband_THFTYPE_IiioI ($$unsorted $$unsorted) Bool)
% 0.20/0.54  (declare-fun tptp.lChris_THFTYPE_i () $$unsorted)
% 0.20/0.54  (declare-fun tptp.lCorina_THFTYPE_i () $$unsorted)
% 0.20/0.54  (declare-fun tptp.lYearFn_THFTYPE_IiiI ($$unsorted) $$unsorted)
% 0.20/0.54  (declare-fun tptp.n2009_THFTYPE_i () $$unsorted)
% 0.20/0.54  (declare-fun tptp.wife_THFTYPE_IiioI ($$unsorted $$unsorted) Bool)
% 0.20/0.54  (declare-fun tptp.inverse_THFTYPE_IIiioIIiioIoI ((-> $$unsorted $$unsorted Bool) (-> $$unsorted $$unsorted Bool)) Bool)
% 0.20/0.54  (assert (@ (@ tptp.inverse_THFTYPE_IIiioIIiioIoI tptp.husband_THFTYPE_IiioI) tptp.wife_THFTYPE_IiioI))
% 0.20/0.54  (assert (forall ((REL2 (-> $$unsorted $$unsorted Bool)) (REL1 (-> $$unsorted $$unsorted Bool))) (=> (@ (@ tptp.inverse_THFTYPE_IIiioIIiioIoI REL1) REL2) (forall ((INST1 $$unsorted) (INST2 $$unsorted)) (= (@ (@ REL1 INST1) INST2) (@ (@ REL2 INST2) INST1))))))
% 0.20/0.54  (assert (forall ((Z $$unsorted)) (@ (@ tptp.holdsDuring_THFTYPE_IiooI Z) true)))
% 0.20/0.54  (assert (exists ((X $$unsorted)) (not (@ (@ tptp.husband_THFTYPE_IiioI tptp.lChris_THFTYPE_i) X))))
% 0.20/0.54  (assert (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (@ (@ tptp.wife_THFTYPE_IiioI tptp.lCorina_THFTYPE_i) tptp.lChris_THFTYPE_i)))
% 0.20/0.54  (assert (not (exists ((R (-> $$unsorted $$unsorted Bool))) (and (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (@ (@ R tptp.lChris_THFTYPE_i) tptp.lCorina_THFTYPE_i)) (not (= R (lambda ((X $$unsorted) (Y $$unsorted)) true)))))))
% 0.20/0.54  (set-info :filename cvc5---1.0.5_15931)
% 0.20/0.54  (check-sat-assuming ( true ))
% 0.20/0.54  ------- get file name : TPTP file name is CSR146^3
% 0.20/0.54  ------- cvc5-thf : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_15931.smt2...
% 0.20/0.54  --- Run --ho-elim --full-saturate-quant at 10...
% 0.20/0.54  % SZS status Theorem for CSR146^3
% 0.20/0.54  % SZS output start Proof for CSR146^3
% 0.20/0.54  (
% 0.20/0.54  (let ((_let_1 (not (exists ((R (-> $$unsorted $$unsorted Bool))) (and (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (@ (@ R tptp.lChris_THFTYPE_i) tptp.lCorina_THFTYPE_i)) (not (= R (lambda ((X $$unsorted) (Y $$unsorted)) true)))))))) (let ((_let_2 (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (@ (@ tptp.wife_THFTYPE_IiioI tptp.lCorina_THFTYPE_i) tptp.lChris_THFTYPE_i)))) (let ((_let_3 (exists ((X $$unsorted)) (not (@ (@ tptp.husband_THFTYPE_IiioI tptp.lChris_THFTYPE_i) X))))) (let ((_let_4 (forall ((REL2 (-> $$unsorted $$unsorted Bool)) (REL1 (-> $$unsorted $$unsorted Bool))) (=> (@ (@ tptp.inverse_THFTYPE_IIiioIIiioIoI REL1) REL2) (forall ((INST1 $$unsorted) (INST2 $$unsorted)) (= (@ (@ REL1 INST1) INST2) (@ (@ REL2 INST2) INST1))))))) (let ((_let_5 (@ (@ tptp.inverse_THFTYPE_IIiioIIiioIoI tptp.husband_THFTYPE_IiioI) tptp.wife_THFTYPE_IiioI))) (let ((_let_6 (ho_12 k_11 (ho_15 k_14 tptp.n2009_THFTYPE_i)))) (let ((_let_7 (ho_13 _let_6 BOOLEAN_TERM_VARIABLE_1065))) (let ((_let_8 (ho_13 _let_6 BOOLEAN_TERM_VARIABLE_1495))) (let ((_let_9 (APPLY_UF ho_13))) (let ((_let_10 (ho_5 (ho_4 k_6 tptp.lCorina_THFTYPE_i) tptp.lChris_THFTYPE_i))) (let ((_let_11 (MACRO_SR_PRED_INTRO :args ((= _let_10 BOOLEAN_TERM_VARIABLE_1065))))) (let ((_let_12 (REFL :args (_let_6)))) (let ((_let_13 (EQ_RESOLVE (ASSUME :args (_let_2)) (TRANS (PREPROCESS :args ((= _let_2 (ho_13 _let_6 _let_10)))) (CONG _let_12 _let_11 :args _let_9))))) (let ((_let_14 (= k_3 k_7))) (let ((_let_15 (not _let_8))) (let ((_let_16 (or _let_15 _let_14))) (let ((_let_17 (forall ((BOUND_VARIABLE_764 |u_(-> $$unsorted $$unsorted Bool)|)) (or (not (ho_13 (ho_12 k_11 (ho_15 k_14 tptp.n2009_THFTYPE_i)) (ho_5 (ho_4 BOUND_VARIABLE_764 tptp.lChris_THFTYPE_i) tptp.lCorina_THFTYPE_i))) (= k_3 BOUND_VARIABLE_764))))) (let ((_let_18 (forall ((R (-> $$unsorted $$unsorted Bool))) (or (not (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (@ (@ R tptp.lChris_THFTYPE_i) tptp.lCorina_THFTYPE_i))) (= R ll_2))))) (let ((_let_19 (EQ_RESOLVE (ASSUME :args (_let_1)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (forall ((R (-> $$unsorted $$unsorted Bool))) (or (not (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (@ (@ R tptp.lChris_THFTYPE_i) tptp.lCorina_THFTYPE_i))) (= R (lambda ((BOUND_VARIABLE_676 $$unsorted) (BOUND_VARIABLE_678 $$unsorted)) true)))) _let_18))) (PREPROCESS :args ((= _let_18 _let_17))))))) (let ((_let_20 (or))) (let ((_let_21 (_let_14))) (let ((_let_22 (ho_4 k_7 tptp.lChris_THFTYPE_i))) (let ((_let_23 (ho_5 _let_22 tptp.lCorina_THFTYPE_i))) (let ((_let_24 (MACRO_SR_PRED_INTRO :args ((= _let_23 BOOLEAN_TERM_VARIABLE_1495))))) (let ((_let_25 (_let_17))) (let ((_let_26 (ho_5 (ho_4 k_3 tptp.lChris_THFTYPE_i) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_16))) (let ((_let_27 (ho_5 _let_22 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_16))) (let ((_let_28 (not _let_14))) (let ((_let_29 (forall ((BOUND_VARIABLE_686 $$unsorted) (BOUND_VARIABLE_687 $$unsorted)) (ho_5 (ho_4 k_3 BOUND_VARIABLE_686) BOUND_VARIABLE_687)))) (let ((_let_30 (forall ((u |u_(-> $$unsorted Bool)|) (e Bool) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted Bool)|)) (not (forall ((ii $$unsorted)) (= (ho_5 v ii) (ite (= i ii) e (ho_5 u ii)))))))))) (let ((_let_31 (forall ((x |u_(-> $$unsorted Bool)|) (y |u_(-> $$unsorted Bool)|)) (or (not (forall ((z $$unsorted)) (= (ho_5 x z) (ho_5 y z)))) (= x y))))) (let ((_let_32 (forall ((u |u_(-> $$unsorted $$unsorted Bool)|) (e |u_(-> $$unsorted Bool)|) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted $$unsorted Bool)|)) (not (forall ((ii $$unsorted)) (= (ho_4 v ii) (ite (= i ii) e (ho_4 u ii)))))))))) (let ((_let_33 (forall ((x |u_(-> $$unsorted $$unsorted Bool)|) (y |u_(-> $$unsorted $$unsorted Bool)|)) (or (not (forall ((z $$unsorted)) (= (ho_4 x z) (ho_4 y z)))) (= x y))))) (let ((_let_34 (forall ((u |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ Bool)|) (e Bool) (i |u_(-> $$unsorted $$unsorted Bool)|)) (not (forall ((v |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ Bool)|)) (not (forall ((ii |u_(-> $$unsorted $$unsorted Bool)|)) (= (ho_10 v ii) (ite (= i ii) e (ho_10 u ii)))))))))) (let ((_let_35 (forall ((x |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ Bool)|) (y |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ Bool)|)) (or (not (forall ((z |u_(-> $$unsorted $$unsorted Bool)|)) (= (ho_10 x z) (ho_10 y z)))) (= x y))))) (let ((_let_36 (forall ((u |u_(-> Bool Bool)|) (e Bool) (i Bool)) (not (forall ((v |u_(-> Bool Bool)|)) (not (forall ((ii Bool)) (= (ho_13 v ii) (ite (= i ii) e (ho_13 u ii)))))))))) (let ((_let_37 (forall ((x |u_(-> Bool Bool)|) (y |u_(-> Bool Bool)|)) (or (not (forall ((z Bool)) (= (ho_13 x z) (ho_13 y z)))) (= x y))))) (let ((_let_38 (forall ((u |u_(-> $$unsorted Bool Bool)|) (e |u_(-> Bool Bool)|) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted Bool Bool)|)) (not (forall ((ii $$unsorted)) (= (ho_12 v ii) (ite (= i ii) e (ho_12 u ii)))))))))) (let ((_let_39 (forall ((x |u_(-> $$unsorted Bool Bool)|) (y |u_(-> $$unsorted Bool Bool)|)) (or (not (forall ((z $$unsorted)) (= (ho_12 x z) (ho_12 y z)))) (= x y))))) (let ((_let_40 (forall ((u |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ _u_(-> $$unsorted $$unsorted Bool)_ Bool)|) (e |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ Bool)|) (i |u_(-> $$unsorted $$unsorted Bool)|)) (not (forall ((v |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ _u_(-> $$unsorted $$unsorted Bool)_ Bool)|)) (not (forall ((ii |u_(-> $$unsorted $$unsorted Bool)|)) (= (ho_9 v ii) (ite (= i ii) e (ho_9 u ii)))))))))) (let ((_let_41 (forall ((x |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ _u_(-> $$unsorted $$unsorted Bool)_ Bool)|) (y |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ _u_(-> $$unsorted $$unsorted Bool)_ Bool)|)) (or (not (forall ((z |u_(-> $$unsorted $$unsorted Bool)|)) (= (ho_9 x z) (ho_9 y z)))) (= x y))))) (let ((_let_42 (forall ((u |u_(-> $$unsorted $$unsorted)|) (e $$unsorted) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted $$unsorted)|)) (not (forall ((ii $$unsorted)) (= (ho_15 v ii) (ite (= i ii) e (ho_15 u ii)))))))))) (let ((_let_43 (forall ((x |u_(-> $$unsorted $$unsorted)|) (y |u_(-> $$unsorted $$unsorted)|)) (or (not (forall ((z $$unsorted)) (= (ho_15 x z) (ho_15 y z)))) (= x y))))) (let ((_let_44 (ho_10 (ho_9 k_8 k_7) k_6))) (let ((_let_45 (forall ((BOUND_VARIABLE_686 $$unsorted) (BOUND_VARIABLE_687 $$unsorted)) (ll_2 BOUND_VARIABLE_686 BOUND_VARIABLE_687)))) (let ((_let_46 (MACRO_SR_PRED_TRANSFORM (AND_INTRO (EQ_RESOLVE (AND_INTRO (ASSUME :args (_let_5)) (PREPROCESS :args (_let_45))) (PREPROCESS :args ((= (and _let_5 _let_45) (and _let_44 _let_29))))) (PREPROCESS :args ((and _let_43 _let_42 _let_41 _let_40 _let_39 _let_38 _let_37 _let_36 _let_35 _let_34 _let_33 _let_32 _let_31 _let_30)))) :args ((and _let_44 _let_29 _let_43 _let_42 _let_41 _let_40 _let_39 _let_38 _let_37 _let_36 _let_35 _let_34 _let_33 _let_32 _let_31 _let_30))))) (let ((_let_47 (_let_29))) (let ((_let_48 (forall ((X $$unsorted)) (ho_5 (ho_4 k_7 tptp.lChris_THFTYPE_i) X)))) (let ((_let_49 (not _let_27))) (let ((_let_50 (not _let_48))) (let ((_let_51 (EQ_RESOLVE (ASSUME :args (_let_3)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (not (forall ((X $$unsorted)) (@ (@ tptp.husband_THFTYPE_IiioI tptp.lChris_THFTYPE_i) X))) _let_50))))))) (let ((_let_52 (_let_49))) (let ((_let_53 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_16)) :args ((or _let_14 _let_15 (not _let_16)))) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (NOT_AND (SCOPE (MACRO_SR_PRED_ELIM (TRANS (SYMM (TRUE_INTRO (ASSUME :args (_let_26)))) (CONG (CONG (SYMM (SYMM (ASSUME :args _let_21))) (REFL :args (tptp.lChris_THFTYPE_i)) :args (APPLY_UF ho_4)) (REFL :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_16)) :args (APPLY_UF ho_5)) (FALSE_INTRO (ASSUME :args _let_52)))) :args (_let_49 _let_14 _let_26))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_49) _let_27))) (REFL :args (_let_28)) (REFL :args ((not _let_26))) :args _let_20)) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_51) :args (_let_50))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_50) _let_48))) (REFL :args _let_52) :args _let_20)) _let_51 :args (_let_49 true _let_48)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_47) :args (tptp.lChris_THFTYPE_i SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_16 QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_47)) (AND_ELIM _let_46 :args (1)) :args (_let_26 false _let_29)) :args (_let_28 true _let_27 false _let_26)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (INSTANTIATE _let_19 :args (k_7 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((ho_4 BOUND_VARIABLE_764 tptp.lChris_THFTYPE_i)))) :args _let_25) (CONG (REFL :args _let_25) (CONG (CONG (CONG _let_12 _let_24 :args _let_9) :args (not)) (REFL :args _let_21) :args _let_20) :args (=>)))) _let_19 :args (_let_16 false _let_17)) :args (_let_15 true _let_14 false _let_16)))) (let ((_let_54 (not BOOLEAN_TERM_VARIABLE_1065))) (let ((_let_55 (= _let_10 _let_23))) (let ((_let_56 (not _let_10))) (let ((_let_57 (not _let_44))) (let ((_let_58 (or _let_57 _let_55))) (let ((_let_59 (forall ((BOUND_VARIABLE_721 |u_(-> $$unsorted $$unsorted Bool)|) (BOUND_VARIABLE_724 |u_(-> $$unsorted $$unsorted Bool)|) (BOUND_VARIABLE_642 $$unsorted) (BOUND_VARIABLE_640 $$unsorted)) (or (not (ho_10 (ho_9 k_8 BOUND_VARIABLE_724) BOUND_VARIABLE_721)) (= (ho_5 (ho_4 BOUND_VARIABLE_721 BOUND_VARIABLE_642) BOUND_VARIABLE_640) (ho_5 (ho_4 BOUND_VARIABLE_724 BOUND_VARIABLE_640) BOUND_VARIABLE_642)))))) (let ((_let_60 (EQ_RESOLVE (ASSUME :args (_let_4)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_4 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (forall ((REL2 (-> $$unsorted $$unsorted Bool)) (REL1 (-> $$unsorted $$unsorted Bool)) (BOUND_VARIABLE_642 $$unsorted) (BOUND_VARIABLE_640 $$unsorted)) (or (not (@ (@ tptp.inverse_THFTYPE_IIiioIIiioIoI REL1) REL2)) (= (@ (@ REL1 BOUND_VARIABLE_640) BOUND_VARIABLE_642) (@ (@ REL2 BOUND_VARIABLE_642) BOUND_VARIABLE_640)))) _let_59))))))) (let ((_let_61 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_58)) :args ((or _let_57 _let_55 (not _let_58)))) (AND_ELIM _let_46 :args (0)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_60 :args (k_6 k_7 tptp.lCorina_THFTYPE_i tptp.lChris_THFTYPE_i QUANTIFIERS_INST_E_MATCHING ((not (= (ho_10 (ho_9 k_8 BOUND_VARIABLE_724) BOUND_VARIABLE_721) false)) (ho_5 (ho_4 BOUND_VARIABLE_721 BOUND_VARIABLE_642) BOUND_VARIABLE_640)))) :args (_let_59))) _let_60 :args (_let_58 false _let_59)) :args (_let_55 false _let_44 false _let_58)))) (let ((_let_62 (not _let_55))) (let ((_let_63 (_let_55))) (let ((_let_64 (not BOOLEAN_TERM_VARIABLE_1495))) (let ((_let_65 (not _let_7))) (let ((_let_66 (MACRO_SR_PRED_INTRO :args ((= (not _let_15) _let_8))))) (let ((_let_67 (_let_64))) (let ((_let_68 (REFL :args (_let_65)))) (let ((_let_69 (_let_54))) (let ((_let_70 (TRUE_INTRO _let_13))) (let ((_let_71 (ASSUME :args (BOOLEAN_TERM_VARIABLE_1065)))) (let ((_let_72 (ASSUME :args (BOOLEAN_TERM_VARIABLE_1495)))) (let ((_let_73 (ASSUME :args (_let_15)))) (let ((_let_74 (SYMM (FALSE_INTRO _let_73)))) (let ((_let_75 (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (NOT_AND (MACRO_SR_PRED_TRANSFORM (SCOPE (AND_INTRO _let_13 _let_71 _let_72 _let_73) :args (BOOLEAN_TERM_VARIABLE_1065 _let_7 BOOLEAN_TERM_VARIABLE_1495 _let_15)) (SCOPE (MACRO_SR_PRED_ELIM (TRANS _let_74 (CONG _let_12 (TRANS (TRUE_INTRO _let_72) (SYMM (TRUE_INTRO _let_71))) :args _let_9) _let_70)) :args (_let_7 BOOLEAN_TERM_VARIABLE_1065 BOOLEAN_TERM_VARIABLE_1495 _let_15)) :args ((not (and BOOLEAN_TERM_VARIABLE_1065 _let_7 BOOLEAN_TERM_VARIABLE_1495 _let_15)) SB_LITERAL))) (CONG (REFL :args _let_69) _let_68 (REFL :args _let_67) _let_66 :args _let_20)) :args ((or _let_65 _let_54 _let_8 _let_64))) _let_53 _let_13 (EQUIV_ELIM1 _let_24) (REORDERING (CNF_EQUIV_POS1 :args _let_63) :args ((or _let_56 _let_23 _let_62))) _let_61 (REORDERING (EQUIV_ELIM1 _let_11) :args ((or BOOLEAN_TERM_VARIABLE_1065 _let_56))) :args (_let_56 true _let_8 false _let_7 false BOOLEAN_TERM_VARIABLE_1495 false _let_23 false _let_55 false BOOLEAN_TERM_VARIABLE_1065)))) (let ((_let_76 (not _let_23))) (let ((_let_77 (ASSUME :args _let_69))) (let ((_let_78 (ASSUME :args _let_67))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (NOT_AND (MACRO_SR_PRED_TRANSFORM (SCOPE (AND_INTRO _let_13 _let_77 _let_78 _let_73) :args (_let_7 _let_54 _let_15 _let_64)) (SCOPE (MACRO_SR_PRED_ELIM (TRANS _let_74 (CONG _let_12 (TRANS (FALSE_INTRO _let_78) (SYMM (FALSE_INTRO _let_77))) :args _let_9) _let_70)) :args (_let_7 _let_54 _let_64 _let_15)) :args ((not (and _let_7 _let_54 _let_15 _let_64)) SB_LITERAL))) (CONG _let_68 (MACRO_SR_PRED_INTRO :args ((= (not _let_54) BOOLEAN_TERM_VARIABLE_1065))) _let_66 (MACRO_SR_PRED_INTRO :args ((= (not _let_64) BOOLEAN_TERM_VARIABLE_1495))) :args _let_20)) :args ((or BOOLEAN_TERM_VARIABLE_1065 _let_65 BOOLEAN_TERM_VARIABLE_1495 _let_8))) (MACRO_RESOLUTION_TRUST (EQUIV_ELIM2 _let_24) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args _let_63) :args ((or _let_10 _let_76 _let_62))) _let_75 _let_61 :args (_let_76 true _let_10 false _let_55)) :args (_let_64 true _let_23)) (MACRO_RESOLUTION_TRUST (EQUIV_ELIM2 _let_11) _let_75 :args (_let_54 true _let_10)) _let_53 _let_13 :args (false true BOOLEAN_TERM_VARIABLE_1495 true BOOLEAN_TERM_VARIABLE_1065 true _let_8 false _let_7)) :args (_let_5 _let_4 (forall ((Z $$unsorted)) (@ (@ tptp.holdsDuring_THFTYPE_IiooI Z) true)) _let_3 _let_2 _let_1 true)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))
% 0.20/0.55  )
% 0.20/0.55  % SZS output end Proof for CSR146^3
% 0.20/0.55  % cvc5---1.0.5 exiting
% 0.20/0.55  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------